Valuation of European Call Options via the Fast Fourier Transform and the Improved Mellin Transform

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Option Valuation Using the Fast Fourier Transform

This paper shows how the fast Fourier Transform may be used to value options when the characteristic function of the return is known analytically.

متن کامل

Quaternionic Fourier-Mellin Transform

In this contribution we generalize the classical Fourier Mellin transform [3], which transforms functions f representing, e.g., a gray level image defined over a compact set of R. The quaternionic Fourier Mellin transform (QFMT) applies to functions f : R → H, for which |f | is summable over R+ × S under the measure dθ dr r . R ∗ + is the multiplicative group of positive and non-zero real numbe...

متن کامل

Fast Approximate Fourier Transform via Wavelets Transform

We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coeecients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...

متن کامل

Fast Fourier Transform for Discrete Asian Options

This paper presents an efficient methodology for the discrete Asian options consistent with different types of underlying densities, especially non-normal returns as suggested by the empirical literature (Mandelbrot (1963) and Fama (1965)). The interest of this method is its flexibility compared to the more standard ones. Based on Fast Fourier Transform, the method is an enhanced version of the...

متن کامل

The Fast Fourier Transform

In the next two lectures, we will continue to expand our toolbox for computing in frequency domain, by adding two important computational tools. The first, the Fast Fourier Transform (FFT) is a family of algorithms for efficiently computing the Discrete Fourier Transform. These algorithms are of great practical importance, as theymake it possible to perform frequency domain analysis of very lar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Finance

سال: 2016

ISSN: 2162-2434,2162-2442

DOI: 10.4236/jmf.2016.62028